The Enigma of SAT Hill-climbing Procedures
نویسندگان
چکیده
In this paper, we investigate a family of hill-climbing procedures related to GSAT, a greedy random hill-climbing procedure for satissability. These procedures are able to solve large and diicult satissability problems beyond the range of conventional procedures like Davis-Putnam. We explore the r^ ole of greediness, randomness and hill-climbing in the eeectiveness of these procedures. We show that neither greediness nor randomness is crucial to GSAT's performance, and that hill-climbing's importance is limited to a short initial phase of search. In addition, we observe some remarkable and possibly universal features of their search for a satisfying truth assignment.
منابع مشابه
Comparison of Genetic and Hill Climbing Algorithms to Improve an Artificial Neural Networks Model for Water Consumption Prediction
No unique method has been so far specified for determining the number of neurons in hidden layers of Multi-Layer Perceptron (MLP) neural networks used for prediction. The present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. The data used in the present research for prediction are consumption data of water...
متن کاملTowards an Understanding of Hill-Climbing Procedures for SAT
Recently several local hill climbing procedures for propositional satis ability have been proposed which are able to solve large and di cult problems beyond the reach of conventional algorithms like Davis Putnam By the introduction of some new variants of these procedures we provide strong experimental evidence to support the conjecture that neither greed iness nor randomness is important in th...
متن کاملA Quantum Genetic Algorithm with Hill Climbing Algorithm for Max 3-sat Problems
In this paper we present a new iterative method to solve the maximum satisfiability problem (MAX SAT). This one aims to find the best assignment for a set of Boolean variables that gives the maximum of verified clauses in a Boolean formula. Unfortunately, It is shown that the MAX SAT problem is NP complete if the number of variable per clause is higher than 3. Our approach called QHILLSAT is a ...
متن کاملA Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملCryptanalysis of Typex
Rotor cipher machines played a large role in World War II: Germany used Enigma; America created Sigaba; Britain developed Typex. The breaking of Enigma by Polish and (later) British cryptanalysts had an enormous impact on the war. However, despite being based on the commercial version of the Enigma, there is no documented successful attack on Typex during its time in service. This paper covers ...
متن کامل